4 found
Order:
  1.  15
    Complexity-sensitive decision procedures for abstract argumentation.Wolfgang Dvořák, Matti Järvisalo, Johannes Peter Wallner & Stefan Woltran - 2014 - Artificial Intelligence 206 (C):53-78.
  2.  11
    Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory.Hannes Strass & Johannes Peter Wallner - 2015 - Artificial Intelligence 226 (C):34-74.
  3.  93
    Reasoning in abstract dialectical frameworks using quantified Boolean formulas.Martin Diller, Johannes Peter Wallner & Stefan Woltran - 2015 - Argument and Computation 6 (2):149-177.
    dialectical frameworks constitute a recent and powerful generalisation of Dung's argumentation frameworks, where the relationship between the arguments can be specified via Boolean formulas. Recent results have shown that this enhancement comes with the price of higher complexity compared to AFs. In fact, acceptance problems in the world of ADFs can be hard even for the third level of the polynomial hierarchy. In order to implement reasoning problems on ADFs, systems for quantified Boolean formulas thus are suitable engines to be (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  4.  41
    On the relation between SPARQL1.1 and Answer Set Programming.Axel Polleres & Johannes Peter Wallner - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):159-212.
    In the context of the emerging Semantic Web and the quest for a common logical framework underpinning its architecture, the relation of rule-based languages such as Answer Set Programming (ASP) and ontology languages such as the Web Ontology Language (OWL) has attracted a lot of attention in the literature over the past years. With its roots in Deductive Databases and Datalog though, ASP shares much more commonality with another Semantic Web standard, namely the Simple Protocol and RDF Query Language (SPARQL). (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark